Fast Marching Methods - Parallel Implementation and Analysis

نویسندگان

  • Maria Cristina Tugurlan
  • Ambar Sengupta
چکیده

Fast Marching represents a very efficient technique for solving front propagation problems, which can be formulated as partial differential equations with Dirichlet boundary conditions, called Eikonal equation:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shared-memory parallelization of the fast marching method using an overlapping domain-decomposition approach

The fast marching method is used to compute a monotone front propagation of anisotropic nature by solving the eikonal equation. Due to the sequential nature of the original algorithm, parallel approaches presented so far were unconvincing. In this work, we introduce a shared-memory parallelization approach which is based on an overlapping domain decomposition technique. We introduce our paralle...

متن کامل

Comparison of the Parallel Fast Marching Method, the Fast Iterative Method, and the Parallel Semi-Ordered Fast Iterative Method

Solving the eikonal equation allows to compute a monotone front propagation of anisotropic nature and is thus a widely applied technique in different areas of science and engineering. Various methods are available out of which only a subset is suitable for shared-memory parallelization, which is the key focus of this analysis. We evaluate three different approaches, those being the recently dev...

متن کامل

A Fast Parallel Marching - Cubes Implementation on the Fujitsu

Parallel computers hold the promise of enabling interactive visualization of very large data sets. Ful lling this promise depends on the development of parallel algorithms and implementations which can e ciently utilize the power of a parallel computer. Fortunately, many visualization algorithms involve performing independent computations on a large collection of data items, making them particu...

متن کامل

Accelerated redistancing for level set-based process simulations with the fast iterative method

The finite iterative method is compared to an industry-hardened fast marching method for accelerating the redistancing step essential for Level Set-based process simulations in the area of technology computer-aided design. We discuss our implementation of the finite iterative method and depict extensions to improve the method for process simulations, in particular regarding stability. Contrary ...

متن کامل

Microsoft Word - 06_02_11.docx

We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and the Fast Iterative Method to determine a numerical solution to the eikonal equation. We point out how the Fast Iterative Method outperforms the other two thanks to its parallel processing capabilities.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008